On exponentially coprime integers
نویسنده
چکیده
d|en d denote the number and the sum of exponential divisors of n, respectively. Properties of these functions were investigated by several authors, see [1], [2], [3], [5], [6], [8]. Two integers n,m > 1 have common exponential divisors iff they have the same prime factors and for n = ∏r i=1 p ai i , m = ∏r i=1 p bi i , ai, bi ≥ 1 (1 ≤ i ≤ r), the greatest common exponential divisor of n and m is
منابع مشابه
On a sequence related to the coprime integers
The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.
متن کاملOn certain arithmetic functions involving exponential divisors
The integer d is called an exponential divisor of n = ∏r i=1 p ai i > 1 if d = ∏r i=1 p ci i , where ci|ai for every 1 ≤ i ≤ r. The integers n = ∏r i=1 p ai i ,m = ∏r i=1 p bi i > 1 having the same prime factors are called exponentially coprime if (ai, bi) = 1 for every 1 ≤ i ≤ r. In this paper we investigate asymptotic properties of certain arithmetic functions involving exponential divisors a...
متن کاملProof of D. J. Newman's Coprime Mapping Conjecture
We call the function / described in the theorem a coprime mapping. Theorem 1 settles in the affirmative a conjecture of D. J. Newman. The special case when / = {JV + l.JV + 2, ...,2Af} was proved by D. E. Daykin and M. J. Baines [2]. V. Chvatal [1] established Newman's conjecture for each JV ^ 1002. We prove Theorem 1 constructively by giving an algorithm for the construction of a coprime mappi...
متن کاملInhomogeneous approximation by coprime integers
This paper addresses a problem recently raised by Laurent and Nogueira about inhomogeneous Diophantine approximation with coprime integers. A corollary of our main theorem is that for any irrational α ∈ R and for any γ ∈ R and > 0 there are infinitely many pairs of coprime integers m,n such that |nα−m− γ| ≤ 1/|n| . This improves upon previously known results, in which the exponent of approximat...
متن کاملOn cycles in the coprime graph of integers
In this paper we study cycles in the coprime graph of integers. We denote by f(n, k) the number of positive integers m ≤ n with a prime factor among the first k primes. We show that there exists a constant c such that if A ⊂ {1, 2, . . . , n} with |A| > f(n, 2) (if 6|n then f(n, 2) = 2 3 n), then the coprime graph induced by A not only contains a triangle, but also a cycle of length 2l + 1 for ...
متن کامل